Subgraphs Graph in a Distance-regular Graph
نویسنده
چکیده
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We show G is strongly regular and determine its parameters. Furthermore assume D is at least 4 and set q := bD−1/(bD−2 − bD−1) in the expression of intersection numbers of Γ. We show that G(∆) is Jq(D − s, 2), the Johnson graph or its q-analogue, for each weak-geodetically closed subgraph ∆ of Γ with diameter s at most D− 3 if and only if (bs+1− bs+2)/(bs − bs+1) = q for 0 ≤ s ≤ D − 3, and in this case q is either 1 or a fixed power of a fixed prime.
منابع مشابه
On Subgraphs in Distance-Regular Graphs
Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملDistance-regular graphs without 4-claws
We determine the distance-regular graphs with diameter at least 3 and c2 ≥ 2 but without induced K1,4-subgraphs.
متن کاملSome Results on the Eigenvalues of Distance-Regular Graphs
In 1986, Terwilliger showed that there is a strong relation between the eigenvalues of a distance-regular graph and the eigenvalues of a local graph. In particular, he showed that the eigenvalues of a local graph are bounded in terms of the eigenvalues of a distance-regular graph, and he also showed that if an eigenvalue θ of the distance-regular graph has multiplicity m less than its valency k...
متن کاملTo the theory of q-ary Steiner and other-type trades
We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner T(k−1, k, v) bitrades, extended 1perfect bitrades. For a distance-regular graph, we show a one-to-one correspondence between the clique bitrades that meet the weight-distribution lower bound on the cardinality and the bipartite isometric subgraphs that are distance-...
متن کامل